Efficient Simulation of Large-Scale Loss Networks

Recently Rajasekaran and Ross [1] presented an algorithm that takes an expected 0(1) time to generate a nonuniform discrete random variate. In this paper we discuss how this algorithm can be employed in the efficient simulation of large-scale telephone networks. In a simulation based upon a standard event-list approach, the generation of a new event in the systems take 0(log n) time. With this new algorithm, event generation becomes an 0(1) process, and simulation times for large networks can be reduced. Comments University of Pennsylvania Department of Computer and Information Sciences Technical Report No. MSCIS-91-62. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/330 Efficient Simulation of Large-Scale Loss Networks MS-CIS-91-62 GRASP LAB 274 Mark Prindiville Sanguthevar Rajasekaran Keith W. Ross Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania Philadelphia, PA 19104-6389